Exploring structure and reformulations in different integer programming algorithms
نویسنده
چکیده
Acknowledgements There are many people I would like to thank who helped me achieve this long-term work. First of all, I would like to thank my supervisor Laurence Wolsey. He has always been remarkably open and available, spending time reading my drafts and discussing my research. I am impressed by his intuition and knowledge of the field. His guidance has been invaluable. He always knows the right questions to ask to make your work progress. He is not only an excellent researcher but he also takes care of every aspect of a researcher's life. Indeed he gave me many opportunities to meet people in the domain, at CORE and in various conferences and to be able to spend time abroad. I am also very grateful to Robert Weismantel for giving me the opportunity to join his group in Magdeburg for three months. His enthusiasm and dynamism pushed me forward. He restored my confidence and encouraged me to complete the thesis. I really enjoyed working with him in Magdeburg. I spent a large amount of time working with Matthias Köppe in Magdeburg. Our work together was very interesting and entertaining. I am impressed by his programming skill and his dedication to his work. I owe a lot to him and Robert for a large part of the work presented here. During the first four years, I was fortunate to be financed by the Belgian National Fund for Scientific Research (FNRS) as a research fellow. The freedom they give to researchers is of great aid for the quality of their work. I am also in debt to the department of applied mathematics which allowed me to complete the thesis by financing my last year. I also wish to thank Leen Stougie and Karen Aardal who welcomed me in the Netherlands for five months and gave me the opportunity to meet a lot of people in a pleasant working atmosphere. I appreciate the time that they devoted to me. In all the places in which I worked during the past five years I met many people that I wish to thank here for their company. First of all, Francisco Or-tega has been like a brother to me. I could always rely on him in any situation. 3 4 We have also worked on our physical shape together by playing squash and badminton games. Mathieu Van Vyve was a tough tennis opponent and I …
منابع مشابه
Reformulation and Decomposition of Integer Programs
We examine ways to reformulate integer and mixed integer programs. Typically, but not exclusively, one reformulates so as to obtain stronger linear programming relaxations, and hence better bounds for use in a branch-and-bound based algorithm. First we cover reformulations based on decomposition, such as Lagrangean relaxation, the Dantzig-Wolfe reformulation and the resulting column generation ...
متن کاملInteger Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations
We consider a single-server scheduling problem given a fixed sequence of job arrivals with random noshows and service durations. The joint probability distribution of the uncertain parameters is assumed to be ambiguous and only the support and first moments are known. We formulate a class of distributionally robust optimization models that incorporate the worst-case expected cost and the worst-...
متن کاملDantzig-Wolfe Reformulations for the Stable Set Problem
Dantzig-Wolfe reformulation of an integer program convexifies a subset of the constraints, which yields an extended formulation with a potentially stronger linear programming (LP) relaxation than the original formulation. This paper is part of an endeavor to understand the strength of such a reformulation in general. We investigate the strength of Dantzig-Wolfe reformulations of the classical e...
متن کاملQuadratic Programming with Discrete Variables
NIE, TIANTIAN. Quadratic Programming with Discrete Variables. (Under the direction of Dr. Shu-Cherng Fang.) In this dissertation, we study the quadratic programming problem with discrete variables (DQP). DQP is important in theory and practice, but the combination of the quadratic feature of the objective function and the discrete nature of the feasible domain makes it hard to solve. In this th...
متن کاملModeling and scheduling no-idle hybrid flow shop problems
Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...
متن کاملThe project portfolio selection and scheduling problem: mathematical model and algorithms
This paper investigates the problem of selecting and scheduling a set of projects among available projects. Each project consists of several tasks and to perform each one some resource is required. The objective is to maximize total benefit. The paper constructs a mathematical formulation in form of mixed integer linear programming model. Three effective metaheuristics in form of the imperialis...
متن کامل